Quickest online selection of an increasing subsequence of specified size

Given a sequence of independent random variables with a common continuous distribution, we consider the online decision problem where one seeks to minimize the expected value of the time that is needed to complete the selection of a monotone increasing subsequence of a prespecified length n. This problem is dual to some online decision problems that have been considered earlier, and this dual problem has some notable advantages. In particular, the recursions and equations of optimality lead with relative ease to asymptotic formulas for mean and variance of the minimal selection time. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 235–252, 2016     

A Trait‐based framework for mutation bias as a driver of long‐term evolutionary trends

Previous work has shown that mutation bias can direct evolutionary trends in genotypic space under strong selection and rare mutation. We present an extension of this work to general traits of the organism. We do this by allowing many different genotypes, with different fitnesses, to have the same trait value. This approach makes novel predictions and shows that the outcome of evolution for a trait is influenced by mutation bias as well as the fitness distribution of the genotypes that have the same trait value. This distribution can alter evolution in interesting ways, depending on the likelihood of generating high fitness mutants. We also show that mutation bias can direct evolution when many mutants are present at any one time. We demonstrate that mutation bias can drive long‐term evolutionary trends when the environment is constantly changing. Under biologically realistic conditions, we show that mutation bias can counter strong gradients of environmental selection over time. We conclude that evolutionary trends can be quite independent of the environment, even when they depress population fitness. Finally, we show that entropy can be a powerful source of mutation bias and can drive evolutionary trends. © 2015 Wiley Periodicals, Inc. Complexity 21: 331–345, 2016     

基于最小交易量和交易费用的多阶段模糊投资组合

考虑了在摩擦市场下的多阶段模糊投资组合模型,基于半绝对方差风险函数,建立了带有最小交易量和交易费用限制的收益最大化多阶段模糊投资组合模型.利用绝对值函数的性质,将模型转化为混合整数线性规划形式,并通过实例验证了模型的可行性,最后对模型与基于可能性均值和可能性方差的多阶段模糊投资组合模型进行了对比,分析了模型的优越性,并验证了模型的可行性.     

A dexterous feature selection artificial immune system algorithm for keystroke dynamics

The main problem in security protecting the computer or resources from intruders. The password and username are the most common means to provide security. But this method has many loop holes such as password sharing, shoulder surfing, brute-force attack, dictionary attack, guessing, and many more. Keystroke dynamics is one popular and inexpensive behavioral biometric technology, which identifies the authenticity of a user when the user is working via a keyboard. Keystroke features like dwell time and flight time of every user are evaluated in this paper by preprocessing techniques such as Hausdroff timing, mean, median, and standard deviation. The artificial immune system is used for feature selection, and comparison between preprocessing techniques is shown.     

The definition of the toxicologically relevant applicability domain for the SNAr reaction for substituted pyridines and pyrimidines

This study outlines how results from a glutathione reactivity assay (so-called in chemico data) can be used to define the applicability domain for the nucleophilic aromatic substitution (S_NAr) reaction for nitrogen-containing aromatic compounds. S_NAr is one of the six mechanistic domains that have been shown to be important in toxicological endpoints in which the ability to bind covalently to a protein is a key molecular initiating event. This study has analysed experimental data (2 h RC₅₀ values), allowing a clear and interpretable structure–activity relationship to be developed for pyridines and pyrimidines which reside within the S_NAr domain. The in-ring nitrogen(s) act as activating groups in the S_NAr reaction. The position(s) of the in-ring nitrogen(s) as well as other activating groups, especially in relationship to the leaving group, affect reactive potency. The experimentally defined applicability domain has resulted in a series of structural alerts. These results build on early work on the benzene derivatives residing in the S_NAr domain. The definition of the applicability domain for the S_NAr reaction and the resulting structural alerts are likely to be beneficial in the development of computational tools for category formation and read-across in hazard identification, and the development of adverse outcome pathways.     

色谱柱分类数据库用于指导天然药物化学对照品色谱纯度测定时色谱柱理性选择

由于中药化学对照品多数来源于动植物药材,很容易混有结构类似物,故有机杂质测定是可能影响其化学对照品赋值准确性的关键风险因素。中药化学对照品的有机杂质测定通常采用药典收载或文献报道的高效液相色谱法,这些方法通常仅规定“以十八烷基硅烷键合硅胶为填充剂”,无适宜色谱柱的品牌信息,或者实验室无文献所用的色谱柱品牌,而目前市场上已有800多种品牌的C₁₈柱,生产工艺的不同导致不同品牌C₁₈柱的选择性有差异,甚至差异显著。这很容易出现由于色谱柱选择不适宜而导致测定结果不准确的风险。该文采用国外色谱柱分类数据库指导对照品纯度考察时色谱柱的理性选择,尽可能减少色谱柱盲选可能导致的纯度结果不准确的风险。首先,用数据库挑选2根选择性差异显著的色谱柱（选择性因子F≥6）进行平行实验,以尽可能反映采用不同品牌色谱柱可能出现的分离效果差异。如果这2根色谱柱的分离效果及纯度测定结果无显著性差异,则可以交叉验证该对照品纯度测定的准确性。否则需要从数据库中选择另外1根与之前试验中分离效果更好、选择性相似的色谱柱进行纯度结果验证。在N-反式-p-对香豆酰基酪胺和表儿茶素没食子酸酯首批对照品的纯度考察中,使用了上述策略并验证了其有效性和科学性,计划推广应用至更多的中药化学对照品,特别当其可能含碱性或弱酸性化合物时,更应该尝试采用本文推荐的色谱柱选择策略交叉验证其纯度测定结果的准确性。     

Secrecy energy efficiency optimization for multiuser massive MIMO wiretap systems with transmit antenna selection

Massive multiple-input-multiple-output (Massive MIMO) significantly improves the capacity of wireless communication systems. However, large-scale antennas bring high hardware costs, and security is a vital issue in Massive MIMO networks. To deal with the above problems, antenna selection (AS) and artificial noise (AN) are introduced to reduce energy consumption and improve system security performance, respectively. In this paper, we optimize secrecy energy efficiency (SEE) in a downlink multi-user multi-antenna scenario, where a multi-antenna eavesdropper attempts to eavesdrop the information from the base station (BS) to the multi-antenna legitimate receivers. An optimization problem is formulated to maximize the SEE by jointly optimizing the transmit beamforming vectors, the artificial noise vector and the antenna selection matrix at the BS. The formulated problem is a nonconvex mixed integer fractional programming problem. To solve the problem, a successive convex approximation (SCA)-based joint antenna selection and artificial noise (JASAN) algorithm is proposed. After a series of relaxation and equivalent transformations, the nonconvex problem is approximated to a convex problem, and the solution is obtained after several iterations. Simulation results show that the proposed algorithm has good convergence behavior, and the joint optimization of antenna selection and artificial noise can effectively improve the SEE while ensuring the achievable secrecy rate.     

A Bootstrap Framework for Aggregating within and between Feature Selection Methods

In the past decade, big data has become increasingly prevalent in a large number of applications. As a result, datasets suffering from noise and redundancy issues have necessitated the use of feature selection across multiple domains. However, a common concern in feature selection is that different approaches can give very different results when applied to similar datasets. Aggregating the results of different selection methods helps to resolve this concern and control the diversity of selected feature subsets. In this work, we implemented a general framework for the ensemble of multiple feature selection methods. Based on diversified datasets generated from the original set of observations, we aggregated the importance scores generated by multiple feature selection techniques using two methods: the Within Aggregation Method (WAM), which refers to aggregating importance scores within a single feature selection; and the Between Aggregation Method (BAM), which refers to aggregating importance scores between multiple feature selection methods. We applied the proposed framework on 13 real datasets with diverse performances and characteristics. The experimental evaluation showed that WAM provides an effective tool for determining the best feature selection method for a given dataset. WAM has also shown greater stability than BAM in terms of identifying important features. The computational demands of the two methods appeared to be comparable. The results of this work suggest that by applying both WAM and BAM, practitioners can gain a deeper understanding of the feature selection process.     

高效选取线性独立的原子特征构建精确机器学习势函数

机器学习势由于具有与第一性原理计算相当的准确性,且低得多的计算成本,在原子模拟中极具前景. 然而原子机器学习势的可靠性、速度和可迁移性在很大程度上取决于原子构型的表示. 适当地选取用作机器学习程序输入的描述符是一个成功的机器学习表示的关键. 本文发展了一种简单有效的方法,可以基于训练数据固有的相关性,从大量待选的描述符中自动选取一组最佳的线性独立原子特征. 通过对几个具有较少冗余线性独立嵌入密度描述符的基准分子构建嵌入原子神经网络势的应用,证明了这种新方法的有效性和准确性. 该算法可以大大简化原子特征的初始选取,并极大地提高原子机器学习势的性能.